On the Optimal Recovery Threshold of Coded Matrix Multiplication
نویسندگان
چکیده
منابع مشابه
Coded Sparse Matrix Multiplication
In a large-scale and distributed matrix multiplication problem C = AB, where C ∈ Rr×t, the coded computation plays an important role to effectively deal with “stragglers” (distributed computations that may get delayed due to few slow or faulty processors). However, existing coded schemes could destroy the significant sparsity that exists in large-scale machine learning problems, and could resul...
متن کاملPolynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication
We consider a large-scale matrix multiplication problem where the computation is carried out using a distributed system with a master node and multiple worker nodes, where each worker can store parts of the input matrices. We propose a computation strategy that leverages ideas from coding theory to design intermediate computations at the worker nodes, in order to optimally deal with straggling ...
متن کاملToward an Optimal Algorithm for Matrix Multiplication
Ever since the dawn of the computer age, researchers have been trying to find an optimal way of multiplying matrices, a fundamental operation that is a bottleneck for many important algorithms. Faster matrix multiplication would give more efficient algorithms for many standard linear algebra problems, such as inverting matrices, solving systems of linear equations, and finding determinants. Eve...
متن کاملMemory-hierarchy optimal matrix multiplication-programs
In many applications that work on huge data sets, from areas like bioinformatics, data-mining, network analysis, optimization, and simulation, the computation time is a major concern. To shorten this time, we have to take into account the many aspects that determine the running time of a program on a modern computer. One of these aspects is the range of different type of memory, from fast but s...
متن کاملOptimal Matrix Multiplication on Fault-Tolerant VLSI Arrays
where h is the decision tree height, or the number of radial cuts, whose i cross edges can be chosen independently: h = (f L-k-l) / (f-1). Therefore, the number of permutations having the number of cross edges i = 1 in a stage-k subgraph of an (3, L) CC-banyan is C;,k=3(3L-k-1)/2, 0 < k < L-2. Now we can evaluate the total number of permutations in CC-banyan with fan-out 3. Theorem 6: The numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2929328